Reuse & Permissions

It is not necessary to obtain permission to reuse this article or its components as it is available under the terms of the Creative Commons Attribution 4.0 International license. This license permits unrestricted use, distribution, and reproduction in any medium, provided attribution to the author(s) and the published article's title, journal citation, and DOI are maintained. Please note that some figures may have been included with permission from other third parties. It is your responsibility to obtain the proper permission from the rights holder directly for these figures.

Export citation

Export citation

Choose format for download:

Download Citation
  • Open Access

Annealing for prediction of grand canonical crystal structures: Implementation of n-body atomic interactions

Yannick Couzinié1,2,*, Yusuke Nishiya1,2, Hirofumi Nishi1,2, Taichi Kosugi1,2, Hidetoshi Nishimori3,4,5, and Yu-ichiro Matsushita1,2,6

  • 1Laboratory for Materials and Structures, Institute of Innovative Research, Tokyo Institute of Technology, Yokohama 226-8503, Japan
  • 2Quemix Incorporated, Taiyo Life Nihombashi Building, 2-11-2, Nihombashi, Chuo-ku, Tokyo 103-0027, Japan
  • 3International Research Frontiers Initiative, Tokyo Institute of Technology, Shibaura, Minato-ku, Tokyo 108-0023, Japan
  • 4Graduate School of Information Sciences, Tohoku University, Sendai 980-8579, Japan
  • 5RIKEN, Interdisciplinary Theoretical and Mathematical Sciences (iTHEMS), Wako, Saitama 351-0198, Japan
  • 6Quantum Material and Applications Research Center, National Institutes for Quantum Science and Technology (QST), 2-12-1, Ookayama, Meguro-ku, Tokyo 152-8552, Japan

  • *couzinie.y.aa@m.titech.ac.jp

Phys. Rev. A 109, 032416 – Published 15 March, 2024

DOI: https://doi.org/10.1103/PhysRevA.109.032416

Abstract

We propose an annealing scheme usable on modern Ising machines for crystal structures prediction (CSP) by taking into account the general n-body atomic interactions and in particular three-body interactions which are necessary to simulate covalent bonds. The crystal structure is represented by discretizing a unit cell and placing binary variables which express the existence or nonexistence of an atom on every grid point. The resulting quadratic unconstrained binary optimization (QUBO) or higher-order unconstrained binary optimization (HUBO) problems implement the CSP problem and is solved using simulated and quantum annealing. Using the example of Lennard-Jones clusters we show that it is not necessary to include the target atom number in the formulation allowing for simultaneous optimization of both the particle density and the configuration and argue that this is advantageous for use on annealing machines as it reduces the total amount of interactions. We further provide a scheme that allows for reduction of higher-order interaction terms that is inspired by the underlying physics. We show for a covalently bonded monolayer MoS2 crystal that we can simultaneously optimize for the particle density as well as the crystal structure using simulated annealing. We also show that we reproduce ground states of the interatomic potential with high probability that are not represented on the initial discretization of the unit cell.

View figure in article

Physics Subject Headings (PhySH)

Article Text

References (77)

  1. J. Maddox, Crystals from first principles, Nature (London) 335, 201 (1988).
  2. A. R. Oganov, C. J. Pickard, Q. Zhu, and R. J. Needs, Structure prediction drives materials discovery, Nat. Rev. Mater. 4, 331 (2019).
  3. C. J. Pickard and R. J. Needs, High-pressure phases of silane, Phys. Rev. Lett. 97, 045504 (2006).
  4. C. J. Pickard and R. J. Needs, Structure of phase III of solid hydrogen, Nat. Phys. 3, 473 (2007).
  5. C. J. Pickard and R. J. Needs, Ab initio random structure searching, J. Phys.: Condens. Matter 23, 053201 (2011).
  6. R. J. Needs and C. J. Pickard, Perspective: Role of structure prediction in materials discovery and design, APL Mater. 4, 053210 (2016).
  7. L. Wille, Minimum-energy configurations of atomic clusters: New results obtained by simulated annealing, Chem. Phys. Lett. 133, 405 (1987).
  8. L. Wille, Simulated annealing and the topology of the potential energy surface of Lennard-Jones clusters, Comput. Mater. Sci. 17, 551 (2000).
  9. X. Yin and C. E. Gounaris, Search methods for inorganic materials crystal structure prediction, Curr. Opin. Chem. Eng. 35, 100726 (2022).
  10. S. Goedecker, Minima hopping: An efficient search method for the global minimum of the potential energy surface of complex molecular systems, J. Chem. Phys. 120, 9911 (2004).
  11. M. Amsler and S. Goedecker, Crystal structure prediction using the minima hopping method, J. Chem. Phys. 133, 224104 (2010).
  12. T. S. Bush, C. R. A. Catlow, and P. D. Battle, Evolutionary programming techniques for predicting inorganic crystal structures, J. Mater. Chem. 5, 1269 (1995).
  13. A. R. Oganov and C. W. Glass, Crystal structure prediction using ab initio evolutionary techniques: Principles and applications, J. Chem. Phys. 124, 244704 (2006).
  14. A. R. Oganov, A. O. Lyakhov, and M. Valle, How evolutionary crystal structure prediction works—and why, Acc. Chem. Res. 44, 227 (2011).
  15. A. O. Lyakhov, A. R. Oganov, H. T. Stokes, and Q. Zhu, New developments in evolutionary structure prediction algorithm USPEX, Comput. Phys. Commun. 184, 1172 (2013).
  16. Y. Wang, J. Lv, L. Zhu, and Y. Ma, Crystal structure prediction via particle-swarm optimization, Phys. Rev. B 82, 094116 (2010).
  17. Y. Zhang, H. Wang, Y. Wang, L. Zhang, and Y. Ma, Computer-assisted inverse design of inorganic electrides, Phys. Rev. X 7, 011017 (2017).
  18. T. Yamashita, S. Kanehira, N. Sato, H. Kino, K. Terayama, H. Sawahata, T. Sato, F. Utsuno, K. Tsuda, T. Miyake, and T. Oguchi, Cryspy: A crystal structure prediction tool accelerated by machine learning, Sci. Technol. Adv. Mater.: Methods 1, 87 (2021).
  19. B. Meredig and C. Wolverton, A hybrid computational–experimental approach for automated crystal structure solution, Nat. Mater. 12, 123 (2013).
  20. P. Gao, Q. Tong, J. Lv, Y. Wang, and Y. Ma, X-ray diffraction data-assisted structure searches, Comput. Phys. Commun. 213, 40 (2017).
  21. N. Tsujimoto, D. Adachi, R. Akashi, S. Todo, and S. Tsuneyuki, Crystal structure prediction supported by incomplete experimental data, Phys. Rev. Mater. 2, 053801 (2018).
  22. D. Adachi, N. Tsujimoto, R. Akashi, S. Todo, and S. Tsuneyuki, Search for common minima in joint optimization of multiple cost functions, Comput. Phys. Commun. 241, 92 (2019).
  23. S. Yoshikawa, R. Sato, R. Akashi, S. Todo, and S. Tsuneyuki, A noise-robust data assimilation method for crystal structure determination using powder diffraction intensity, J. Chem. Phys. 157, 224112 (2022).
  24. Y. Zhao, R. Sato, and S. Tsuneyuki, Accelerating simulated annealing of glassy materials with data assimilation, J. Non-Cryst. Solids 600, 122028 (2023).
  25. T. Kadowaki and H. Nishimori, Quantum annealing in the transverse Ising model, Phys. Rev. E 58, 5355 (1998).
  26. C. Durr and P. Hoyer, A quantum algorithm for finding the minimum, arXiv:quant-ph/9607014.
  27. T. Albash and D. A. Lidar, Adiabatic quantum computation, Rev. Mod. Phys. 90, 015002 (2018).
  28. T. Jones, S. Endo, S. McArdle, X. Yuan, and S. C. Benjamin, Variational quantum algorithms for discovering Hamiltonian spectra, Phys. Rev. A 99, 062304 (2019).
  29. S. McArdle, T. Jones, S. Endo, Y. Li, S. C. Benjamin, and X. Yuan, Variational ansatz-based quantum simulation of imaginary time evolution, npj Quantum Inf. 5, 75 (2019).
  30. T. Kosugi, Y. Nishiya, H. Nishi, and Y.-I. Matsushita, Imaginary-time evolution using forward and backward real-time evolution with a single ancilla: First-quantized eigensolver algorithm for quantum chemistry, Phys. Rev. Res. 4, 033121 (2022).
  31. V. S. Denchev, S. Boixo, S. V. Isakov, N. Ding, R. Babbush, V. Smelyanskiy, J. Martinis, and H. Neven, What is the computational value of finite-range tunneling? Phys. Rev. X 6, 031015 (2016).
  32. P. Hauke, H. G. Katzgraber, W. Lechner, H. Nishimori, and W. D. Oliver, Perspectives of quantum annealing: Methods and implementations, Rep. Prog. Phys. 83, 054401 (2020).
  33. A. D. King, S. Suzuki, J. Raymond, A. Zucca, T. Lanting, F. Altomare, A. J. Berkley, S. Ejtemaee, E. Hoskinson, S. Huang, E. Ladizinsky, A. J. R. MacDonald, G. Marsden, T. Oh, G. Poulin-Lamarre, M. Reis, C. Rich, Y. Sato, J. D. Whittaker, J. Yao et al., Coherent quantum annealing in a programmable 2,000 qubit Ising chain, Nat. Phys. 18, 1324 (2022).
  34. C. C. McGeoch, R. Harris, S. P. Reinhardt, and P. I. Bunyk, Practical annealing-based quantum computing, Computer 52, 38 (2019).
  35. K. Boothby, P. Bunyk, J. Raymond, and A. Roy, Next-generation topology of D-Wave quantum processors, arXiv:2003.00133.
  36. H. Hirai, T. Horiba, S. Shirai, K. Kanno, K. Omiya, Y. O. Nakagawa, and S. Koh, Molecular structure optimization based on electrons–nuclei quantum dynamics computation, ACS Omega 7, 19784 (2022).
  37. T. Kosugi, H. Nishi, and Y.-I. Matsushita, Exhaustive search for optimal molecular geometries using imaginary-time evolution on a quantum computer, npj Quantum Inf. 9, 112 (2023).
  38. T. Kanao and H. Goto, Simulated bifurcation for higher-order cost functions, Appl. Phys. Express 16, 014501 (2023).
  39. R. Tanburn, E. Okada, and N. Dattani, Reducing multi-qubit interactions in adiabatic quantum computation without adding auxiliary qubits. Part 1: The “deduc-reduc” method and its application to quantum factorization of numbers, arXiv:1508.04816.
  40. D. Bertsimas and J. Tsitsiklis, Simulated annealing, Stat. Sci. 8, 10 (1993).
  41. S. A. Solla, G. B. Sorkin, and S. R. White, Configuration space analysis for optimization problems, in Disordered Systems and Biological Organization, edited by E. Bienenstock, F. F. Soulié, and G. Weisbuch (Springer, Berlin, Heidelberg, 1986), pp. 283–293.
  42. R. Eglese, Simulated annealing: A tool for operational research, Eur. J. Oper. Res. 46, 271 (1990).
  43. D. Henderson, S. H. Jacobson, and A. W. Johnson, The theory and practice of simulated annealing, in Handbook of Metaheuristics, edited by F. Glover and G. A. Kochenberger (Springer US, Boston, 2003), pp. 287–319.
  44. C. McGeoch and P. Farré, Advantage Processor Overview, D-Wave Technical Report Series 14-1058A-A (D-Wave Systems Inc., 3033 Beta Ave, Burnaby, BC V5G 4M9 Canada, 2022).
  45. V. Choi, Minor-embedding in adiabatic quantum computation: I. The parameter setting problem, Quantum Inf. Process. 7, 193 (2008).
  46. V. Choi, Minor-embedding in adiabatic quantum computation: II. minor-universal graph design, Quantum Inf. Process. 10, 343 (2011).
  47. S. Zbinden, A. Bärtschi, H. Djidjev, and S. Eidenbenz, Embedding algorithms for quantum annealers with chimera and pegasus connection topologies, in High Performance Computing, edited by P. Sadayappan, B. L. Chamberlain, G. Juckeland, and H. Ltaief (Springer International Publishing, Cham, 2020), pp. 187–206.
  48. E. Pelofske, G. Hahn, and H. Djidjev, Advanced unembedding techniques for quantum annealers, in 2020 International Conference on Rebooting Computing (ICRC) (Atlanta, GA, USA, 2020), pp. 34–41.
  49. L. Prielinger, A. Hartmann, Y. Yamashiro, K. Nishimura, W. Lechner, and H. Nishimori, Two-parameter counter-diabatic driving in quantum annealing, Phys. Rev. Res. 3, 013227 (2021).
  50. T. Kadowaki and H. Nishimori, Greedy parameter optimization for diabatic quantum annealing, Philos. Trans. R. Soc., A 381, 20210416 (2023).
  51. E. B. Tadmor, R. S. Elliott, J. P. Sethna, R. E. Miller, and C. A. Becker, The potential of atomistic simulations and the knowledgebase of interatomic models, JOM 63, 17 (2011).
  52. N. Bernardes, Theory of solid Ne, A, Kr, and Xe at 0 K, Phys. Rev. 112, 1534 (1958).
  53. R. S. Elliott and E. B. Tadmor, Knowledgebase of interatomic models (KIM) application programming interface (API), https://openkim.org/kim-api (2011).
  54. E. Tadmor, Driver for the Lennard-Jones model uniformly shifted to have zero energy at the cutoff radius v004, OpenKIM, https://doi.org/10.25950/bdffd6a6 (2020).
  55. E. Tadmor, Lennard-Jones model (shifted) for Kr with parameters from Bernardes (1958) (low precision cutoff) v004, OpenKIM, https://doi.org/10.25950/29c4bf9b (2020).
  56. H. Chen and D. A. Lidar, Why and when pausing is beneficial in quantum annealing, Phys. Rev. Appl. 14, 014100 (2020).
  57. Z. Gonzalez Izquierdo, S. Grabbe, H. Idris, Z. Wang, J. Marshall, and E. Rieffel, Advantage of pausing: Parameter setting for quantum annealers, Phys. Rev. Appl. 18, 054056 (2022).
  58. C. G. Broyden, The convergence of a class of double-rank minimization algorithms 1. General considerations, IMA J. Appl. Math. 6, 76 (1970).
  59. R. Fletcher, A new approach to variable metric algorithms, Comput. J. 13, 317 (1970).
  60. D. Goldfarb, A family of variable-metric methods derived by variational means, Math. Comput. 24, 23 (1970).
  61. D. F. Shanno, Conditioning of quasi-Newton methods for function minimization, Math. Comput. 24, 647 (1970).
  62. F. H. Stillinger and T. A. Weber, Computer simulation of local order in condensed phases of silicon, Phys. Rev. B 31, 5262 (1985).
  63. F. H. Stillinger and T. A. Weber, Erratum: Computer simulation of local order in condensed phases of silicon, Phys. Rev. B 33, 1451(E) (1986).
  64. M. Wen, S. N. Shirodkar, P. Plecháč, E. Kaxiras, R. S. Elliott, and E. B. Tadmor, A force-matching Stillinger-Weber potential for MoS2: Parameterization and Fisher information theory based sensitivity analysis, J. Appl. Phys. 122, 244301 (2017).
  65. M. Wen, Stillinger-Weber model driver for monolayer MX2 systems v001, OpenKIM, https://doi.org/10.25950/7d664757 (2018).
  66. Y. Kurniawan, C. Petrie, K. Williams, M. K. Transtrum, R. S. Elliott, E. B. Tadmor, D. S. Karls, and M. Wen, Modified Stillinger-Weber potential (MX2) for monolayer MoS2 by Kurniawan et al. (2022) v000, OpenKIM, https://doi.org/10.25950/328bfabb (2022).
  67. Y. Kurniawan, C. L. Petrie, K. J. Williams Jr., M. K. Transtrum, E. B. Tadmor, R. S. Elliott, D. S. Karls, and M. Wen, Bayesian, frequentist, and information geometric approaches to parametric uncertainty quantification of classical empirical interatomic potentials, J. Chem. Phys. 156, 214103 (2022).
  68. E. Boros and A. Gruber, On quadratization of pseudo-Boolean functions, arXiv:1404.6538.
  69. M. Anthony, E. Boros, Y. Crama, and A. Gruber, Quadratic reformulations of nonlinear binary optimization problems, Math. Program. 162, 115 (2017).
  70. N. Dattani, Quadratization in discrete optimization and quantum mechanics, arXiv:1901.04405.
  71. G. Kresse and J. Hafner, Ab initio molecular dynamics for liquid metals, Phys. Rev. B 47, 558 (1993).
  72. G. Kresse and J. Furthmüller, Efficient iterative schemes for ab initio total-energy calculations using a plane-wave basis set, Phys. Rev. B 54, 11169 (1996).
  73. G. Kresse and J. Furthmüller, Efficiency of ab-initio total energy calculations for metals and semiconductors using a plane-wave basis set, Comput. Mater. Sci. 6, 15 (1996).
  74. P. E. Blöchl, Projector augmented-wave method, Phys. Rev. B 50, 17953 (1994).
  75. G. Kresse and D. Joubert, From ultrasoft pseudopotentials to the projector augmented-wave method, Phys. Rev. B 59, 1758 (1999).
  76. V. V. Gusev, D. Adamson, A. Deligkas, D. Antypov, C. M. Collins, P. Krysta, I. Potapov, G. R. Darling, M. S. Dyer, P. Spirakis, and M. J. Rosseinsky, Optimality guarantees for crystal structure prediction, Nature (London) 619, 68 (2023).
  77. P. P. Ewald, Die Berechnung optischer und elektrostatischer Gitterpotentiale, Ann. Phys. 369, 253 (1921).

Outline

Information

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation